Sub-optimal Sensor Scheduling with Error Bounds
نویسنده
چکیده
In this paper the problem of sub-optimal sensor scheduling with a guaranteed distance to optimality is considered. Optimal in the sense that the sequence that minimizes the estimation error covariance matrix for a given time horizon is found. The search is done using relaxed dynamic programming. The algorithm is then applied to one simple second order system and one sixth order model of a fixed mounted model lab helicopter. Copyright c ©2005 IFAC
منابع مشابه
Sensor data scheduling for optimal state estimation with communication energy constraint
In this paper, we consider sensor data scheduling with communication energy constraint. A sensor has to decide whether to send its data to a remote estimator or not due to the limited available communication energy. We construct effective sensor data scheduling schemes that minimize the estimation error and satisfy the energy constraint. Two scenarios are studied: the sensor has sufficient comp...
متن کاملA Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy in dense networks, and by scheduling nodes efficiently, minimum battery drainage is possible. In this paper, we focus on the problem of Minimum Connected Sensor Cover (MCSC), an NP-hard problem, and describe a distributed greed...
متن کاملA Sensor Scheduling Considering Estimation Error Variance and Communication Energy
This paper deals with a sensor scheduling considering estimation error variance and communication energy in sensor networked feedback system. We propose an decentralized estimation algorithm with unknown inputs in each sensor node. Most existing works deal with the sensor network systems as sensing systems and it is difficult to apply them to the real physical feedback control systems Then some...
متن کاملDecentralized detection in resource-limited sensor network architectures
We consider the problem of decentralized binary detection in a network consisting of a large number of nodes arranged as a tree of bounded height. We show that the error probability decays exponentially fast with the number of nodes under both a NeymanPearson criterion and a Bayesian criterion, and provide bounds for the optimal error exponent. Furthermore, we show that under the Neyman-Pearson...
متن کاملA JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005